A Counterexample to “Threshold Boolean form for joint probabilistic constraints with random technology matrix”

نویسنده

  • James Luedtke
چکیده

Recently, in the paper “Threshold Boolean form for joint probabilistic constraints with random technology matrix” (Math. Program. 147:391–427, 2014), Kogan and Lejeune proposed a set of mixed-integer programming formulations for probabilistically constrained stochastic programs having random constraint matrix and finite support distribution. We show that the proposed formulations do not in general correctly model such problems. In particular, we characterize the structure of the feasible region defined by the proposed formulations, and provide an example of a probabilistically constrained stochastic program that has a feasible region that does not match this structure.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Threshold Boolean form for joint probabilistic constraints with random technology matrix

We develop a new modeling and exact solution method for stochastic programming problems that include a joint probabilistic constraint in which the multirow random technology matrix is discretely distributed. We binarize the probability distribution of the random variables in such a way that we can extract a threshold partially defined Boolean function (pdBf) representing the probabilistic const...

متن کامل

On random ordering constraints – Revised 14/10/2008

Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear ordering of the variables in question. A clause becomes true given a linear ordering iff the relative ordering of its variables obeys the constraint considered. The naturally arising satisfiability problems are NP-complete for many typ...

متن کامل

Support vector regression with random output variable and probabilistic constraints

Support Vector Regression (SVR) solves regression problems based on the concept of Support Vector Machine (SVM). In this paper, a new model of SVR with probabilistic constraints is proposed that any of output data and bias are considered the random variables with uniform probability functions. Using the new proposed method, the optimal hyperplane regression can be obtained by solving a quadrati...

متن کامل

Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems

We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy [11]. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary and sufficient for the existence of a sharp threshold in the case where constraint templates are applied with equal probability, solving thus an open prob...

متن کامل

ar X iv : c s . D M / 0 50 30 83 v 1 2 9 M ar 2 00 5 Coarse and Sharp Thresholds of Boolean Constraint Satisfaction Problems ∗

We study threshold properties of random constraint satisfaction problems under a probabilistic model due to Molloy [11]. We give a sufficient condition for the existence of a sharp threshold that leads (for boolean constraints) to a necessary and sufficient for the existence of a sharp threshold in the case where constraint templates are applied with equal probability, solving thus an open prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015